Full abstraction for Idealized Algol with passive expressions
نویسندگان
چکیده
منابع مشابه
Full Abstraction for Idealized Algol with Passive Expressions
model of Idealized Algol raises signi cant problems over and above those associated with the full abstraction problem for PCF [20, 29]. In a previous paper [5, 6], we gave the rst fully abstract model of Idealized Algol with active, i.e. possibly side-e ecting, expressions. It is signi cantly harder to capture the \pure" version of Idealized Algol originally proposed by Reynolds, in which a sha...
متن کاملAutomata-Theoretic Semantics of Idealized Algol with Passive Expressions
Passive expressions in Algol-like languages represent computations that read the state but do not modify it. The need for such read-only computations arises in programming logics as well as in concurrent programming. It is also a central facet in Reynolds’s Syntactic Control of Interference. Despite its importance and essentially basic character, capturing the notion of passivity in semantic mo...
متن کاملIdealized Algol with activeexpressionsExtended
The manipulation of objects with state which changes over time is all-pervasive in computing. Perhaps the simplest example of such objects are the program variables of classical imperative languages. An important strand of work within the study of such languages, pioneered by John Reynolds, focuses on \Idealized Algol", an elegant synthesis of imperative and functional features. We present a no...
متن کاملLinearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions
The manipulation of objects with state which changes over time is all-pervasive in computing. Perhaps the simplest example of such objects are the program variables of classical imperative languages. An important strand of work within the study of such languages, pioneered by John Reynolds, focusses on \Idealized Algol", an elegant synthesis of imperative and functional features. We present a n...
متن کاملReasoning about Idealized ALGOL Using Regular Languages
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our method of reasoning inherits its desirable theoretical properties. The method is mathematically elementary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00047-x